MATHEMATICAL MODELLING FOR DICE FINDER GAME PROBLEM

author

  • Sanjay Jain https://sites.google.com/site/drsanjayjaingca/ Government College, Ajmer Affiliated to M D S University, Ajmer India Department of Mathematical Sciences,Associate Professor
Abstract:

Play is often episodic and mission-centric, with a series of challenges culminating in a final puzzle or enemy that must be overcome. Multiple missions played with the same characters may be related to each other in a plot arc of escalating challenges. The exact tone, structure, pace and end (if any) vary from game to game depending on the needs and preferences of the players, as in [9]. "THE CHANCE ELEMENT in thousands of indoor games is introduced by a variety of simple random-number generators. The most popular of such devices, ever since the time of ancient Egypt, have been cubical Dice. Cubical, Because of their symmetry, any of the five regular solids can be and have been used as gaming dice, but the cube has certain obvious advantages over the other four solids. It is the easiest to make, its six sides accommodate a set of numbers neither too large nor too small, and it rolls easily enough but not too easily", as in [1], [2]. In our proposed Dice Finder game problem, user can see the different dice number's on screen from 1 to 6. Using the property of Dice that “Opposite sides of a dice add up to seven”, user has to find that correct number of dice out all of that, for which one condition is true.  

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Pedagogical Possibilities for the Dice Game Pig

Simple examples are teaching treasures. Finding a concise, effective illustration is like finding a precious gem. When such an example is fun and intriguing, it is educational gold. In this paper, we share the jeopardy dice game of Pig, which has extremely simple rules, engaging play, and a complex optimal policy. We describe its historical uses in mathematics, and share ways in which we have u...

full text

Image Identification Scheme for Dice Game

In this paper, based on the features of dice images and the least distance criterion (LDC) method, we developed an autorecognition scheme for dice games. First, we use R plane to replace gray-scale image to speed up processing. Next, we use O’stu method to convert the R plane into binary. Furthermore, image pre-processing steps are used to filter out the noise, and a non-circular object discard...

full text

A Game of Nontransitive Dice

We consider a two player simultaneous-move game where the two players each select any permissible n-sided die for a fixed integer n. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for n > 3, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard n-sided die, where each side has a dif...

full text

Meta-evolutionary Game Dynamics for Mathematical Modelling of Rules Dynamics

This paper proposes an evolutionary-game-theory model, called meta-evolutionary game dynamics, for studying the dynamics of rules and individual behaviour. Although there are two game theoretical views of rules, i.e., seeing rules as game forms and as equilibria of games, endogenous changes of rules are not modelled effectively by either of these two views. We introduce a model for integrating ...

full text

Optimal minimax strategy in a dice game

Each of two players, by turns, rolls a dice several times accumulating the successive scores until he decides to stop, or he rolls an ace. When stopping, the accumulated turn score is added to the player account and the dice is given to his opponent. If he rolls an ace, the dice is given to the opponent without adding any point. In this paper we formulate this game in the framework of competiti...

full text

Optimal Play of the Farkle Dice Game

We present and solve optimality equations for the 2-player, jeopardy dice game Farkle (a.k.a. Dix Mille, Ten Thousand). For fairest play, we recommend 200 compensation points at the beginning of the game for the second player. We then compute the strategy that maximizes expected score, demonstrate a means for replicating such play with mental mathematics, and augment this method so as to enable...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2 (SPRING)

pages  135- 150

publication date 2014-03-21

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023